Multi-state two-machine permutation flow shop scheduling optimisation with time-dependent energy costs
نویسندگان
چکیده
منابع مشابه
Investigation of the two-machine flow shop scheduling problem to minimize total energy costs with time-dependent energy prices
In this paper, the problem of two-machine flow shop scheduling to minimize total energy costs under time-of-use tariffs is investigated. As the objective function of this study is not a regular measure, allowing intentional idle-time can be advantageous. So this study considers two approaches, one for non-delay version of the problem and the other one for a situation when inserting intentional ...
متن کاملMinimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop
[if gte mso 9]> The purpose of this paper is to consider the problem of scheduling a set of start time-dependent jobs in a two-machine flow shop, in which the actual processing times of jobs increase linearly according to their starting time. The objective of this problem is to minimize the makespan. The problem is known to be NP-hardness[ah1] ; therefore, there is no polynomial-time algorithm...
متن کاملTwo machine Flow shop with transportation time
We present a scheduling problem of the flow-shop type. We introduce a transportation system: robot or conveyor. This transportation system is also involved in machine loading and unloading. The studied workshop consists of two machines and a conveyor that must process a set of tasks. Tasks having just been executed wait for the conveyor to be transported. The objective is to determine a feasibl...
متن کاملInverse scheduling: two-machine flow-shop problem
We study an inverse counterpart of the two machine flow-shop scheduling problem that arises in the context of inverse optimization. While in the forward scheduling problem all parameters are given and the objective is to find job sequence(s) for which the value of the makespan is minimum, in the inverse scheduling the exact values of processing times are unknown and they should be selected with...
متن کاملMulti-objective Particle Swarm Optimisation for Robust Dynamic Scheduling in a Permutation Flow Shop
This paper proposes a multi-objective optimisation model and particle swarm optimisation solution method for the robust dynamic scheduling of permutation flow shop in the presence of uncertainties. The proposed optimisation model for robust scheduling considers utility, stability and robustness measures to generate robust schedules that minimise the effect of different real-time events on the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2020
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2020.12.291